8 research outputs found

    A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation

    Full text link
    Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaining close to optimal solutions. Using a multi-objective approach, we evolve constrained continuous problems having a set of linear and/or quadratic constraints where the different evolutionary approaches show a significant difference in performance. Afterwards, we discuss the features of the constraints that exhibit a difference in performance of the different evolutionary approaches under consideration.Comment: 16 Pagesm 2 Figure

    A feature-based comparison of evolutionary computing techniques for constrained continuous optimisation

    No full text
    Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaining close to optimal solutions. Using a multi-objective approach, we evolve constrained continuous problems having a set of linear and/or quadratic constraints where the different evolutionary approaches show a significant difference in performance. Afterwards, we discuss the features of the constraints that exhibit a difference in performance of the different evolutionary approaches under consideration.Shayan Poursoltan and Frank Neuman

    Group search and evacuation

    No full text
    Group search and evacuation are fundamental tasks performed by a set of co-operating, autonomous mobile agents. The two tasks are similar in that they both aim to search a given domain so as to locate a target which has been placed at an unknown location in the domain. However they also differ in that the former terminates when the first searcher in the group reaches the target while the latter when the last searcher in the group reaches the target. Variations where termination is determined by some designated agent have also been considered. Depending on the domain being explored we distinguish linear search when the target is placed on the infinite line and circular search when the target is placed on the perimeter of a disk. The agents move with their own maximum speed, and the goal is to design algorithms that minimize the worst case termination time. Two communication models between the Robots are being considered: in the non-wireless (or face-to-face) communication model, Robots exchange information only when simultaneously located at the same point, and wireless communication in which Robots can communicate with one another anywhere at any time. In this paper we survey some of the most interesting recent algorithmic results on search and evacuation concerning mobile agents with and without faults

    Hybrid Evolutionary Algorithms: Methodologies, Architectures, and Reviews

    No full text
    Evolutionary computation has become an important problem solving methodology among many researchers. The population-based collective learning process, self-adaptation, and robustness are some of the key features of evolutionary algorithms when compared to other global optimization techniques. Even though evolutionary computation has been widely accepted for solving several important practical applications in engineering, business, commerce, etc., yet in practice sometimes they deliver only marginal performance. Inappropriate selection of various parameters, representation, etc. are frequently blamed. There is little reason to expect that one can find a uniformly best algorithm for solving all optimization problems. This is in accordance with the No Free Lunch theorem, which explains that for any algorithm, any elevated performance over one class of problems is exactly paid for in performance over another class. Evolutionary algorithm behavior is determined by the exploitation and exploration relationship kept throughout the run. All these clearly illustrates the need for hybrid evolutionary approaches where the main task is to optimize the performance of the direct evolutionary approach. Recently, hybridization of evolutionary algorithms is getting popular due to their capabilities in handling several real world problems involving complexity, noisy environment, imprecision, uncertainty, and vagueness. In this chapter, first we emphasize the need for hybrid evolutionary algorithms and then we illustrate the various possibilities for hybridization of an evolutionary algorithm and also present some of the generic hybrid evolutionary architectures that has evolved during the last couple of decades. We also provide a review of some of the interesting hybrid frameworks reported in the literature

    Evolutionary neuro-fuzzy systems and applications

    No full text
    In recent years, the use of hybrid soft computing methods has shown that in various applications the synergism of several techniques is superior to a single technique. For example, the use of a neural fuzzy system and an evolutionary fuzzy system hybridises the approximate reasoning mechanism of fuzzy systems with the learning capabilities of neural networks and evolutionary algorithms. Evolutionary neural systems hybridise the neurocomputing approach with the solution-searching ability of evolutionary computing. Such hybrid methodologies retain limitations that can be overcome with full integration of the three basic soft computing paradigms, and this leads to evolutionary neural fuzzy systems. The objective of this chapter is to provide an account of hybrid soft computing systems, with special attention to the combined use of evolutionary algorithms and neural networks in order to endow fuzzy systems with learning and adaptive capabilities. After an introduction to basic soft computing paradigms, the various forms of hybridisation are considered, which results in evolutionary neural fuzzy systems. The chapter also describes a particular approach that jointly uses neural learning and genetic optimisation to learn a fuzzy model from the given data and to optimise it for accuracy and interpretability

    130 years of Plant Lectin Research

    No full text
    corecore